Adversary model - PDFSEARCH.IO - Document Search Engine

Adversary model
Results: 85

#	Item
21	BANDITS WITHOUT REGRETS: THE POWER OF ADAPTIVE ADVERSARIES Nicol`o Cesa-Bianchi Dipartimento di Informatica Universit`a degli Studi di Milano, Italy Add to Reading List Source URL: www.me.inf.kyushu-u.ac.jp Language: English - Date: 2013-10-14 22:31:27 Online algorithms Adversary model Adversary Multi-armed bandit Regret Switching barriers Bandit Costs Bianchi Statistics Decision theory Analysis of algorithms
22	Tight Bounds for Asynchronous Renaming1 DAN ALISTARH, Microsoft Research Cambridge JAMES ASPNES2 , Yale KEREN CENSOR-HILLEL3 , Technion SETH GILBERT4 , National University of Singapore RACHID GUERRAOUI, EPFL Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Algorithm Time complexity Randomized algorithm Adversary model Consensus Distributed computing Complexity Quantum algorithm Theoretical computer science Applied mathematics Computational complexity theory
23	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Computer science Algorithm Randomized algorithm Time complexity Adversary model Asymptotically optimal algorithm Quantum algorithm Computational complexity theory Theoretical computer science Applied mathematics Analysis of algorithms
24	Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Computational complexity theory Applied mathematics Competitive analysis K-server problem Randomized algorithm Metrical task system Adversary model Minimum spanning tree Bin packing problem Theoretical computer science Online algorithms Analysis of algorithms
25	Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Consensus Algorithm Time complexity Adversary model Logarithm Theoretical computer science Computational complexity theory Applied mathematics
26	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:06 Computer science Computational complexity theory Algorithm Mathematical logic Randomized algorithm Time complexity Adversary model Distributed computing Quantum algorithm Theoretical computer science Applied mathematics Analysis of algorithms
27	Fast Randomized Test-and-Set and Renaming Dan Alistarh1 , Hagit Attiya1,2 , Seth Gilbert1 , Andrei Giurgiu1 , and Rachid Guerraoui1 1 Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland 2 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:01 Analysis of algorithms Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm Complexity Consensus Adversary model In-place algorithm Theoretical computer science Applied mathematics Mathematics
28	Trust-‐based Anonymous Communica4on: Models and Rou4ng Algorithms Aaron Johnson U.S. Naval Research Laboratory Paul Syverson U.S. Naval Resea Add to Reading List Source URL: freehaven.net Language: English - Date: 2011-11-02 11:33:27 Software Cryptographic software Tor Adversary model Onion Onion routing Internet privacy Horse racing Computing
29	Journal of Artificial Intelligence Research367 Submitted 1/14; published 6/14 Game-Theoretic Security Patrolling with Dynamic Execution Uncertainty and a Case Study on a Real Transit System Add to Reading List Source URL: jair.org Language: English - Date: 2014-06-19 15:08:32 Analysis of algorithms Artificial intelligence Game theory Markov models Tambe Adversary model Stackelberg competition Markov decision process Uncertainty Statistics Science Markov processes
30	Gossiping in a Multi-Channel Radio Network An Oblivious Approach to Coping with Malicious Interference (Extended Abstract) Shlomi Dolev1 , Seth Gilbert2 , Rachid Guerraoui3 , and Calvin Newport4 1 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:21:17 Analysis of algorithms NP-complete problems Adversary model Gossip protocol Clique Time complexity Algorithm Theoretical computer science Applied mathematics Computational complexity theory